Discrete Mathematics

Results: 2210



#Item
531

CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-03-23 01:43:29
    532

    CS 70 Spring 2008 Discrete Mathematics for CS David Wagner

    Add to Reading List

    Source URL: www.cs.berkeley.edu

    Language: English - Date: 2015-01-21 19:48:43
      533

      CS 70 Fall 2003 Discrete Mathematics for CS Wagner

      Add to Reading List

      Source URL: www.cs.berkeley.edu

      Language: English - Date: 2015-01-21 19:48:43
        534

        CS 70 Spring 2008 Discrete Mathematics for CS David Wagner

        Add to Reading List

        Source URL: www.cs.berkeley.edu

        Language: English - Date: 2015-01-21 19:48:43
          535

          ICME QUALIFYING EXAM DISCRETE MATHEMATICS AND ALGORITHMS Let G(V, E) be a connected d-regular graph, v0 ∈ V (G), and assume that at each node, the ends of the edges incident with the node are labelled 1, 2, · · · d.

          Add to Reading List

          Source URL: stanford.edu

          - Date: 2015-03-23 01:44:05
            536

            CS 70 Spring 2008 Discrete Mathematics for CS David Wagner

            Add to Reading List

            Source URL: www.cs.berkeley.edu

            Language: English - Date: 2015-01-21 19:48:43
              537

              CS 70 Spring 2008 Discrete Mathematics for CS David Wagner

              Add to Reading List

              Source URL: www.cs.berkeley.edu

              Language: English - Date: 2015-01-21 19:48:43
                538

                SIAM J. DISCRETE MATH. Vol. 17, No. 4, pp. 634–660 c 2004 Society for Industrial and Applied Mathematics 

                Add to Reading List

                Source URL: sma.epfl.ch

                Language: English - Date: 2010-12-09 15:56:25
                  539

                  To appear in: Unusual Applications of Number Theory, M. Nathanson, ed., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 2002. Random walks with badly approximable numbers Doug Hensley and Francis

                  Add to Reading List

                  Source URL: www.math.hmc.edu

                  Language: English - Date: 2001-08-06 16:29:50
                    540

                    SIAM J. DISCRETE MATH. Vol. 28, No. 3, pp. 1578–1600 c 2014 Society for Industrial and Applied Mathematics 

                    Add to Reading List

                    Source URL: www.wisdom.weizmann.ac.il

                    Language: English - Date: 2014-10-23 09:15:16
                      UPDATE